Minimax Converse for Identification via Channels
نویسندگان
چکیده
A minimax converse for the identification via channels is derived. By this converse, a general formula capacity, which coincides with transmission proved without assumption of strong property. Furthermore, optimal second-order coding rate characterized when type I error probability non-vanishing and II vanishing. Our built upon so-called partial channel resolvability approach; however, argument enables us to circumvent flaw reported in literature.
منابع مشابه
Strong converse for identification via quantum channels
In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede’s recently discovered appoach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking val...
متن کاملA Minimax Converse for Quantum Channel Coding
We prove a one-shot “minimax” converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdú [IEEE Trans. Info. Theory 56, 2307–2359 (2010)] for classical channel coding, and also enjoys the saddle point property enabling the order of optimizations to be intercha...
متن کاملNew Strong Converse for Asymmetric Broadcast Channels
We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.
متن کاملIdentification via Quantum Channels
We review the development of the quantum version of Ahlswede and Dueck’s theory of identification via channels. As is often the case in quantum probability, there is not just one but several quantizations: we know at least two different concepts of identification of classical information via quantum channels, and three different identification capacities for quantum information. In the present ...
متن کاملConverse bounds via coupling for interference channels and proof of Costa’s conjecture
It is shown that under suitable regularity conditions, differential entropy is O( √ n)-Lipschitz as a function of probability distributions on R with respect to the quadratic Wasserstein distance. Under similar conditions, (discrete) Shannon entropy is shown to be O(n)-Lipschitz in distributions over the product space with respect to Ornstein’s d̄-distance (Wasserstein distance corresponding to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3120033